Explorations in 4-peg Tower of Hanoi
نویسندگان
چکیده
Finding an optimal solution to the 4-peg version of the classic Tower of Hanoi problem has been an open problem since the 19th century, despite the existence of a presumed-optimal solution. We verify that the presumed-optimal Frame-Stewart algorithm for 4-peg Tower of Hanoi is indeed optimal, for up to 20 discs. We also develop a distributed Tower of Hanoi algorithm, and present 2D and 3D representations of the state transition graphs. Finally, two variants (k-out-of-order and k-at-a-time) and an analogy with distributed agent software are suggested.
منابع مشابه
Combinatorics of topmost discs of multi-peg Tower of Hanoi problem
Combinatorial properties of the multi-peg Tower of Hanoi problem on n discs and p pegs are studied. Top-maps are introduced as maps which reflect topmost discs of regular states. We study these maps from several points of view. We also count the number of edges in graphs of the multi-peg Tower of Hanoi problem and in this way obtain some combinatorial identities.
متن کاملComplexity of the Path Multi-Peg Tower of Hanoi
The Tower of Hanoi problem with h ≥ 4 pegs is long known to require a sub-exponential number of moves in order to transfer a pile of n disks from one peg to another. In this paper we discuss the Pathh variant, where the pegs are placed along a line, and disks can be moved from a peg to its nearest neighbor(s) only. Whereas in the simple variant there are h(h − 1)/2 bi-directional interconnectio...
متن کاملSolving the Tower of Hanoi with Random Moves
The Tower of Hanoi puzzle consists of n disks of distinct sizes distributed across 3 pegs. We will refer to a particular distribution of the disks across the pegs as a state and call it valid if on each peg disks form a pile with the disk sizes decreasing from bottom up. Since each disk can reside at one of 3 pegs, while the order of disks on each peg is uniquely defined by their sizes, the tot...
متن کاملOn the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
It is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all equivalent. Among them the classical approaches of Stewart and Frame from 1941 can be found.
متن کاملThe Average Distance between Nodes in the Cyclic Tower of Hanoi Digraph
The cyclic Tower of Hanoi puzzle is similar to the traditional tower puzzle, but with the added restriction that all disks move between pegs in a clockwise direction, from peg A to B, from B to C, or from C to A. Many aspects of this puzzle have been analyzed, including the average distance in the state digraph from a random state to a designated goal state in which all disks are on one peg. Us...
متن کامل